CS 359 G : Graph Partitioning and Expanders Handout 8
نویسنده
چکیده
In which we introduce the Leighton-Rao relaxation of sparsest cut. Let G = (V, E) be an undirected graph. Unlike past lectures, we will not need to assume that G is regular. We are interested in finding a sparsest cut in G, where the sparsity of a non-trivial bipartition (S, V − S) of the vertices is which is the ratio between the fraction of edges that are cut by (S, V − S) and the fraction of pairs of vertices that are disconnected by the removal of those edges.
منابع مشابه
CS 359 G : Graph Partitioning and Expanders Handout 16
A family of expanders is a family of graphs Gn = (Vn, En), |Vn| = n, such that each graph is dn-regular, and the edge-expansion of each graph is at least h, for an absolute constant h independent of n. Ideally, we would like to have such a construction for each n, although it is usually enough for most applications that, for some constant c and every k, there is an n for which the construction ...
متن کاملCOSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
متن کاملUsing graph partitioning for efficient network modularity optimization
The paper reviews an approach for finding the communities of a network developed by the authors [WAW’06, Lecture Notes in Computer Science, Volume 4936/2008, 117-128, IEEE TPDS vol. PP, issue 99, 2012], which is based on a reduction of the modularity optimization problem to the minimum weighted cut problem, and gives an experimental evaluation of an implementation based on that approach on grap...
متن کامل3-Monotone Expanders
Expanders are classes of highly connected graphs that are of fundamental importance in graph theory, with numerous applications, especially in theoretical computer science [29]. While the literature contains various definitions of expanders, this paper focuses on bipartite expanders. For ∈ (0, 1], a bipartite graph G with bipartition V (G) = A ∪ B is a bipartite -expander if |A| = |B| and |N(S)...
متن کاملApproximation Algorithms for Finding Maximum Induced Expanders
We initiate the study of approximating the largest induced expander in a given graph G. Given a ∆-regular graph G with n vertices, the goal is to find the set with the largest induced expansion of size at least δ ·n. We design a bi-criteria approximation algorithm for this problem; if the optimum has induced spectral expansion λ our algorithm returns a λ log δ exp(∆/λ) -(spectral) expander of s...
متن کامل